Parallel Implementations of Perceptual Grouping Tasks on Distributed Memory Machines

(Summary of Results) Abstract In this paper, we propose parallel implementations for solving Perceptual Grouping tasks on distributed memory machines. Our implementations show that, given 7K line segments extracted from a 1K 1K image, the Line Grouping task can be performed in 0.486 seconds using a partition of CM-5 having 256 processing nodes and in 0.382 seconds using a 16-node Cray T3D. The serial implementation written in C takes 20.368 seconds and 4.181 seconds using 1-node CM-5 and 1-node T3D respectively. Our code is written in C and MPI message passing standard and can be easily ported to other high performance computing platforms.